The iterative deferred acceptance mechanism

نویسندگان

چکیده

Lately, there has been an increase in the use of sequential mechanisms, instead traditional direct counterparts, college admissions many countries, including Germany, Brazil, and China. We describe these mechanisms identify their shortcomings terms incentives outcome properties. introduce a new mechanism, which improves upon shortcomings. Unlike ask students for full preference ranking over colleges, our mechanism asks to sequentially make choices or submit partial rankings from sets colleges. These are used produce tentative allocation at each step. If some point it is determined that student can no longer be accepted into previous choice, then she asked another choice among colleges would tentatively accept her. Participants following simple strategy choosing most-preferred step ex-post equilibrium yields Student-Optimal Stable Matching.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic Matching Markets and the Deferred Acceptance Mechanism

Many matching markets are dynamic, with one side’s priorities often depending on previous allocations. This creates opportunities for manipulations that do not exist in static matching problems. The school-choice problem, for example, exhibits considerable student mobility and a priority system that favors incumbent students and their siblings. In such a dynamic environment, parents can manipul...

متن کامل

Axioms for Deferred Acceptance

The deferred acceptance algorithm is often used to allocate indivisible objects when monetary transfers are not allowed. We provide two characterizations of agent-proposing deferred acceptance allocation rules. Two new axioms, individually rational monotonicity and weak Maskin monotonicity, are essential to our analysis. An allocation rule is the agent-proposing deferred acceptance rule for som...

متن کامل

Trade-offs in School Choice: Comparing Deferred Acceptance, the Naive and the Adaptive Boston Mechanism

Abstract We compare the three most common school choice mechanisms: the Deferred Acceptance mechanism (DA), the classic näıve Boston mechanism (NBM), and a variant of the Boston mechanism where students automatically skip exhausted schools, which we call the adaptive Boston mechanism (ABM). When priorities are random we show that the three mechanisms form two hierarchies, one in terms of incent...

متن کامل

Trade-offs in School Choice: Comparing Deferred Acceptance, the Classic and the Adaptive Boston Mechanism∗

The three most common school choice mechanisms are the Deferred Acceptance mechanism (DA), the classic Boston mechanism (BM), and a variant of the Boston mechanism where students automatically skip exhausted schools, which we call the adaptive Boston mechanism (ABM). Assuming truthful reporting, we compare student welfare under these mechanisms both from a conceptual and from a quantitative per...

متن کامل

Trade-offs in School Choice: Comparing Deferred Acceptance, the Näıve and the Adaptive Boston Mechanism

So far, research on school choice mechanisms has focused primarily on two procedures: the Deferred Acceptance (DA) mechanism and the (näıve) Boston mechanism (NBM). A variant of the Boston mechanism, where students automatically skip exhausted schools in the application process, has been largely overlooked by researchers, but is nonetheless frequently used in practice. We formalize this adaptiv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Games and Economic Behavior

سال: 2022

ISSN: ['0899-8256', '1090-2473']

DOI: https://doi.org/10.1016/j.geb.2022.07.001